Combined Projection Algorithms for Generalized Stokes Problems
نویسنده
چکیده
Two projected methods have been proposed to deal with the two main diiculties of the numerical solution of incompressible Stokes problems. While one method enforces the null{ divergency condition through a projection 1], the other 4] projects the solution to satisfy boundary conditions. After summarizing these two techniques, the present report shows how to combine both into an accurate, eecient and simple generalized Stokes solver for large scale computations with a variety of complex and realistic boundary conditions. Preconditioning of the resulting projected system is handled by using specially designed matrices that share the same range and null space as the Boundary Condition (BC) projector Q and so commute with Q. The same idea can of course be applied to the single BC projection method introduced in 4], where the problem was left unsolved. One problem in implementing the double projection method concerns the rank-deeciencies introduced by the projector Q. In this paper we show how to eeciently compute the null{divergence (ND) projector P in presence of such rank deeciencies as well as the ones naturally found in CFD problems.
منابع مشابه
On the numerical solution of generalized Sylvester matrix equations
The global FOM and GMRES algorithms are among the effective methods to solve Sylvester matrix equations. In this paper, we study these algorithms in the case that the coefficient matrices are real symmetric (real symmetric positive definite) and extract two CG-type algorithms for solving generalized Sylvester matrix equations. The proposed methods are iterative projection metho...
متن کاملApproximating fixed points for nonexpansive mappings and generalized mixed equilibrium problems in Banach spaces
We introduce a new iterative scheme for nding a common elementof the solutions set of a generalized mixed equilibrium problem and the xedpoints set of an innitely countable family of nonexpansive mappings in a Banachspace setting. Strong convergence theorems of the proposed iterative scheme arealso established by the generalized projection method. Our results generalize thecorresponding results...
متن کاملCOVERT Based Algorithms for Solving the Generalized Tardiness Flow Shop Problems
Four heuristic algorithms are developed for solving the generalized version of tardiness flow shop problems. We consider the generalized tardiness flow shop model with minimization of the total tardiness as its performance measure. We modify the concept of cost over time (COVERT) for the generalized version of the flow shop tardiness model and employ this concept for developing four algorithms....
متن کاملEfficient Variable-coefficient Finite-volume Stokes Solvers
We investigate several robust preconditioners for solving the saddle-point linear systems that arise from spatial discretization of unsteady and steady variable-coefficient Stokes equations on a uniform staggered grid. Building on the success of using the classical projection method as a preconditioner for the coupled velocity-pressure system [B. E. Griffith, J. Comp. Phys., 228 (2009), pp. 756...
متن کاملA Set of Algorithms for Solving the Generalized Tardiness Flowshop Problems
This paper considers the problem of scheduling n jobs in the generalized tardiness flow shop problem with m machines. Seven algorithms are developed for finding a schedule with minimum total tardiness of jobs in the generalized flow shop problem. Two simple rules, the shortest processing time (SPT), and the earliest due date (EDD) sequencing rules, are modified and employed as the core of seque...
متن کامل